Tabu Search Techniques for Examination Timetabling
نویسندگان
چکیده
The Examination Timetabling problem regards the scheduling for the exams of a set of university courses, avoiding the overlapping of exams having students in common, fairly spreading the exams for the students, and satisfying room capacity constraints. We present a family of solution algorithms for a set of variants of the Examination Timetabling problem. The algorithms are based on tabu search, and they import several features from the research on the Graph Colouring problem. Our algorithms are tested on both public benchmarks and random instances, and compared with previous results in the literature.
منابع مشابه
An Investigation of a Tabu Search Based Hyper-heuristic for Examination Timetabling
This paper investigates a tabu search based hyper-heuristic for solving examination timetabling problems. The hyper-heuristic framework uses a tabu list to monitor the performance of a collection of low-level heuristics and then make tabu heuristics that have been applied too many times, thus allowing other heuristics to be applied. Experiments carried out on examination timetabling datasets fr...
متن کاملManaging the tabu list length using a fuzzy inference system: an application to exams timetabling
In this paper we present an application of Tabu Search (TS) to the exams timetabling problem. One of the drawback of this meta-heuristic is related with some parameter that can affect the performance of the algorithm and must be tuned. One of such is tabu tenure which is much problem dependent. Our goal is to have a automatic process of managing the memory which is important for practical appli...
متن کاملA Case Based Heuristic Selection investigation of Hill Climbing, Simulated Annealing and Tabu Search for Exam Timetabling Problems
The examination timetabling problem has been studied in many different forms and using a variety of techniques over the years [1], [3], [4], [6]. In its simplest form, it is required that a set of exams are scheduled into a set of time periods in such a way that no two exams with students in common are scheduled at the same time. In practice there are a wide range of other constraints which mus...
متن کاملQuikFix A Repair-based Timetable Solver
QuikFix is a software program for solving timetabling problems. The software adapts repair-based heuristic search known in SAT solving to the timetabling domain. A high-level timetabling-specific model enforces structural constraints and allows for meaningful moves in the search space, such as swaps of the time slots or venues of events. QuikFix uses known techniques to improve the search perfo...
متن کامل